{	Problem: http://codeforces.ru/problemset/problem/67/A
	Verdict: Accepted
}
uses math;
var n,i,cur,j:longint; a:array[1..10010] of longint; s:ansistring;
begin
readln(n);
readln(s);
for i:=1 to n do begin
  a[i]:=1;
  cur:=1;
  for j:=i to n-1 do
    if s[j]='R' then break else
    if s[j]='L' then inc(cur);
  a[i]:=max(a[i],cur);
  cur:=1;
  for j:=i-1 downto 1 do
    if s[j]='L' then break else
    if s[j]='R' then inc(cur);
  a[i]:=max(a[i],cur);
end;
for i:=1 to n do write(a[i],' ');
end.